Search results for "Zero of a function"
showing 2 items of 2 documents
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory
2007
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. This is why Boolean functions are needed with a high number of essential variables and a low polynomial degree. Unfortunately, it is a well-known problem to construct such functions. The best separation between these two complexity measures of a Boolean function was exhibited by Ambai- nis [5]. He constructed functions with polynomial degree M and number of variables Omega(M2). We improve such a separation to become exponenti…
More limit cycles than expected in Liénard equations
2007
The paper deals with classical polynomial Lienard equations, i.e. planar vector fields associated to scalar second order differential equations x"+ f(x)x' + x = 0 where f is a polynomial. We prove that for a well-chosen polynomial f of degree 6, the equation exhibits 4 limit cycles. It induces that for n ≥ 3 there exist polynomials f of degree 2n such that the related equations exhibit more than n limit cycles. This contradicts the conjecture of Lins, de Melo and Pugh stating that for Lienard equations as above, with f of degree 2n, the maximum number of limit cycles is n. The limit cycles that we found are relaxation oscillations which appear in slow-fast systems at the boundary of classic…